Branch and bound - PDFSEARCH.IO - Document Search Engine

Branch and bound
Results: 97

#	Item
51	Proceedings of the Twenty-Third Australasian Database Conference (ADC 2012), Melbourne, Australia A Branch and Bound Method for Min-dist Location Selection Queries Jianzhong Qi1 Zhenghua Xu2 Add to Reading List Source URL: people.eng.unimelb.edu.au Language: English - Date: 2012-04-27 08:47:18 Complexity classes Operations research NP Facility location Branch and bound Time complexity Theoretical computer science Computational complexity theory Applied mathematics
52	Annals of Operations Research 140, 67–124, 2005 c 2005 Springer Science + Business Media, Inc. Manufactured in The Netherlands. Integer-Programming Software Systems ¨ Add to Reading List Source URL: ieor.berkeley.edu Language: English - Date: 2005-12-30 19:46:34 Numerical analysis Combinatorial optimization Linear programming relaxation Linear programming Relaxation Cutting-plane method Branch and bound Algorithm Heuristic function Mathematical optimization Mathematics Operations research
53	Outline Branch and Bound Algorithms for Nearest Neighbor Search: Lecture 1 Yury Lifshits http://yury.name Add to Reading List Source URL: simsearch.yury.name Language: English - Date: 2007-09-11 18:32:40 Computing Nearest neighbor search K-d tree R-tree Vp-tree M-tree Locality-sensitive hashing K-nearest neighbor algorithm Honda P series Information science Mathematics Search algorithms
54	Yet Harder Knapsack ProblemsI Stasys Jukna∗,1 Georg Schnitger University of Frankfurt, Institut of Computer Science, DFrankfurt, Germany. Abstract Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2011-10-21 09:58:40 Computational complexity theory Combinatorial optimization NP-complete problems Cryptography Dynamic programming Knapsack problem Branch and bound Optimization problem Backtracking Operations research Theoretical computer science Applied mathematics
55	20th International Congress on Modelling and Simulation, Adelaide, Australia, 1–6 December 2013 www.mssanz.org.au/modsim2013 A branch-and-bound algorithm for scheduling unit processing time arc shutdown jobs to maximiz Add to Reading List Source URL: www.mssanz.org.au Language: English - Date: 2013-12-04 18:33:21 Applied mathematics 4I Flow network Mathematics
56	A Branch and Bound Method for Min-dist Location Selection Queries Jianzhong Qi1 Zhenghua Xu2 Yuan Xue3 Add to Reading List Source URL: people.eng.unimelb.edu.au Language: English - Date: 2011-11-07 02:44:04 Complexity classes Operations research NP Facility location Branch and bound Time complexity Theoretical computer science Computational complexity theory Applied mathematics
57	Artificial Intelligence Artificial Intelligence Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2009-03-06 00:35:16 NP-complete problems Complexity classes Operations research Combinatorial optimization Travelling salesman problem Optimization problem NP Branch and bound Mathematical optimization Theoretical computer science Computational complexity theory Applied mathematics
58	SPIDER Attack on a Network of POMDPs: Towards Quality Bounded Solutions Add to Reading List Source URL: www.aaai.org Language: English - Date: 2007-04-18 17:31:17 Stochastic control Operations research Partially observable Markov decision process Reinforcement learning Markov decision process Heuristic function Mathematical optimization Pruning Branch and bound Statistics Dynamic programming Markov processes
59	Computers and Operations Research (2013), to appear. Achieving MILP Feasibility Quickly Using General Disjunctions Hanan Mahmoud ([removed]) John W. Chinneck ([removed]) Systems and Com Add to Reading List Source URL: www.sce.carleton.ca Language: English - Date: 2013-03-11 13:59:51 Mathematics Convex optimization Linear programming Scheduling Candidate solution Branch and bound Mathematical optimization Operations research Combinatorial optimization